Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle
نویسندگان
چکیده
We give a polynomial time Turing reduction from the γ √ napproximate closest vector problem on a lattice of dimension n to a γapproximate oracle for the shortest vector problem. This is an improvement over a reduction by Kannan, which achieved γn 3
منابع مشابه
Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors
We show that given oracle access to a subroutine which returns approximate closest vectors in a lattice, one may find in polynomial time approximate shortest vectors in a lattice. The level of approximation is maintained; that is, for any function f , the following holds: Suppose that the subroutine, on input a lattice L and a target vector w (not necessarily in the lattice), outputs v ∈ L such...
متن کاملSVP is no harder than CVP
We write A ≤T B to denote that A is Turing-reducible to B; A is Turing-reducible to a problem B if given an oracle for B, one can compute answers to A. In this case we will show taht if we can compute correct answers for CV Pγ , we can use this to compute the γ-shortest vector of some fixed lattice. Note that the decision formulation of CV P is NP-hard while (the natural decision version of) SV...
متن کاملSampling Short Lattice Vectors and the Closest Lattice Vector Problem
We present a 2 O(n) time Turing reduction from the closest lattice vector problem to the shortest lattice vector problem. Our reduction assumes access to a subroutine that solves SVP exactly and a subroutine to sample short vectors from a lattice, and computes a (1+)-approximation to CVP. As a consequence, using the SVP algorithm from 1], we obtain a randomized 2 O(1+ ?1)n algorithm to obtain a...
متن کاملLattices with Many Cycles Are Dense
We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Z/Λ has n− 1 cycles of equal length with arbitrary precision. We also show that a direct consequence of this is that the Shortest Vector Problem and the Closest Vector Problem cannot be easier for this type of lattices than for general lattices.
متن کاملNumber Balancing is as Hard as Minkowski's Theorem and Shortest Vector
The number balancing (NBP) problem is the following: given real numbers a1, . . . , an ∈ [0, 1], find two disjoint subsets I1, I2 ⊆ [n] so that the difference | ∑ i∈I1 ai − ∑ i∈I2 ai| of their sums is minimized. An application of the pigeonhole principle shows that there is always a solution where the difference is at most O( √ n 2n ). Finding the minimum, however, is NP-hard. In polynomial tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011